Note—Post-Infeasibility Analysis in Linear Programming
نویسندگان
چکیده
منابع مشابه
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
We describe simple and exact duals, and certificates of infeasibility and weak infeasibility in conic linear programming which do not rely on any constraint qualification, and retain most of the simplicity of the Lagrange dual. In particular, some of our infeasibility certificates generalize the row echelon form of a linear system of equations, and the “easy” proofs – as sufficiency of a certif...
متن کاملSENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملInfeasibility Analysis for Linear Systems, a Survey
We discuss infeasibility analysis (study of changes needed to make an infeasible system feasible) for systems of linear constraints.
متن کاملRepairing Infeasibility in Fuzzy Goal Programming
The problem of solving a multi-objective programming problem, by assuming that the decision maker has fuzzy goals for each of the objectives, is addressed. In this case a fuzzy goal programming problem has to be solved. But when we have several objectives it can be a difficult task for the decision maker to determine coherent aspiration levels, so it is possible that the tolerance thresholds be...
متن کاملsensitivity analysis in linear-plus-linear fractional programming problems
in this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1979
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.25.9.916